Shape Retrieval through Angular Distance with Shortest Augmenting Path Algorithm
نویسنده
چکیده
Problem statement: The shape of an object is very important in object recognition. Shape matching is a challenging problem, especially when articulation and deformation of a part occurs. These variations may be insignificant for human recognition but often cause a matching algorithm to give results that are inconsistent with our perception. Approach: We proposed a customized approach to measure similarity between shapes and exploit it for shape retrieval. The similarity was measured using the correspondence between the points on the two shapes and applying the aligning transformation. The correspondence was solved by the shape context with shortest augmenting path algorithm. Based on the correspondence, the aligning transformation is applied which best aligns the two shapes. Thin Plate Spline (TPS) with angular distance was to provide the better class of transformation maps. The matching error was calculated by the errors between the correspondence points on the two shapes and energy required in aligning transformation. Object recognition was achieved by the k-nearest neighbor algorithm. Result: The algorithm was efficient method for shape matching which performs the well on bulls eye test and produce 91.23% of retrieval rate on MPEG database. Conclusion: The proposed method is simple, invariant to noise and gives better error rate compare to the existing methods. It can also be extended to the handwritten characters, industrial objects, face recognition and COIL data base.
منابع مشابه
Shape Retrieval through Mahalanobis Distance with Shortest Augmenting Path Algorithm
Shape matching and object recognition plays an vital role in the computer vision. The shape matching is difficult in case of the real world images like mpeg database images since the real world images has the internal and external contours. The Mahalanobis distance based shape context approach is proposed to measure similarity between shapes and exploit it for shape retrieval. The process of sh...
متن کاملDistance-Directed Augmenting Path Algorithms for Maximum Flow and Parametric Maximum Flow Problems
Until recently, fast algorithms for the maximum flow problem have typically proceeded by constructing layered networks and establishing blocking flows in these networks. However, in recent years, new distance-directed algorithms have been suggested that do not construct layered networks but instead maintain a distance label with each node. The distance label of a node is a lower bound on the le...
متن کاملFace Recognition Using Contour-Based Multiscale Distance Matrix
Face Recognition is an emerging approach in the recent years. In this paper, the formulation of a face recognition approach using contour-based shape descriptor named Multiscale Distance Matrix (MDM) is developed using the concept of inner-distance in the distance matrix instead of the Euclidean distance. In the proposed scheme, first the similarity in the shape of the face is found by taking a...
متن کاملMin - Cost Flow Algorithms 10 . 1 Shortest Augmenting Paths : Unit Capacity Networks
Proof: (by induction). We want to show that one SAP doesn’t introduce negative cycles in Gf . Initially there are no negative cost cycles. Feasible prices can be computed by using shortest path distances from s. After finding the shortest s-t path, it has reduced cost 0. Every arc on the path has reduced length 0. This demonstrates that the triangle inequality property is tight on shortest path...
متن کاملEfficient Shape Matching Via Graph Cuts
Meaningful notions of distance between planar shapes typically involve the computation of a correspondence between points on one shape and points on the other. To determine an optimal correspondence is a computationally challenging combinatorial problem. Traditionally it has been formulated as a shortest path problem which can be solved efficiently by Dynamic Time Warping. In this paper, we sho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011